package algorithm.graph;

/**
 * @author DengZhiYuan
 * @version 1.0
 * @date 2022/12/24 22:38
 */
public class PriorityQueue {
    //使用数组保存
    private Vertex[] nodes;
    //总数
    private int count;
    public PriorityQueue(int v){
        this.nodes = new Vertex[v + 1];
        this.count = v;
    }

    public Vertex poll(){
        return null;
    }
    public void add(Vertex vertex){
        //更新节点的值，并且从下往上堆化，重新符合堆的定义
    }
    public void update(Vertex vertex){

    }
    public boolean isEmpty(){
        return false;
    }

}
